Computations for Analysis, Geometry and Topology

نویسنده

  • Kaushik Kalyanaraman
چکیده

My research agenda is built on formulating problems in analysis, geometry and topology for a computational realization and conversely, use of computation for formalizing notions in analysis, geometry and topology. The former stems from a motivation to provide solutions for problems in science and engineering using tools of scientific and high performance computing while the latter encapsulates experimentation as a means to deriving theoretical insights. My primary research interests are in structure preserving solutions of ordinary and partial differential equations (PDEs) posed in the language of calculus on manifolds. A compatible or structure preserving discretization is a discrete scheme established to ensure that the discrete world faithfully reproduces essential properties of the continuum. This entails, for example, computing solutions while ensuring underlying physical quantities are conserved, say, velocities in the solution of a flow problem modeled as a PDE. Other examples of structure preservation include discrete conservation laws for energies and symmetries of solutions, geometric quantities such as volume and orientation preservation in the discrete model, and topological properties of the discrete domain over which the problem is modeled such as Betti numbers. This enterprise, thus, intimately conjoins analysis, geometry and topology. A secondary aspect of my interests, consequently, involves applied and computational topology, and discrete differential geometry. Analysis and topology have long been known to be an example of duality in mathematics. As a result, some problems in analysis can be solved by equivalently posing it as one in topology, in itself expressed using algebra. In this setup, I am interested in both finding efficient algorithms for performing such computations and determining engineering and scientific problems that can be modeled using these computational tools. Finally, I am also interested in manifold theory with a view towards computation, again, chiefly in the role of bridging the abstract with the applied via computation. My thesis involves using two different discrete solution approaches for numerically solving PDEs in the generalized setting of calculus on manifolds: finite element exterior calculus (FEEC) and discrete exterior calculus (DEC). In particular, the main problem of my work is in showing convergence of DEC for elliptic PDEs. In addition, my work also includes exploring some connections of these methods to topology and manifold theory; in this area I have shown an efficient way to compute discrete harmonics and extended the applicability of DEC to a larger class of meshes [HKWW11, HKV12].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TOPOLOGY OPTIMIZATION OF PLANE STRUCTURES USING BINARY LEVEL SET METHOD AND ISOGEOMETRIC ANALYSIS

This paper presents the topology optimization of plane structures using a binary level set (BLS) approach and isogeometric analysis (IGA). In the standard level set method, the domain boundary is descripted as an isocountour of a scalar function of a higher dimensionality. The evolution of this boundary is governed by Hamilton–Jacobi equation. In the BLS method, the interfaces of subdomai...

متن کامل

A Geometry Preserving Kernel over Riemannian Manifolds

Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...

متن کامل

ISOGEOMETRIC TOPOLOGY OPTIMIZATION OF STRUCTURES USING LEVEL SET METHOD INCORPORATING SENSITIVITY ANALYSIS

This study focuses on the topology optimization of structures using a hybrid of level set method (LSM) incorporating sensitivity analysis and isogeometric analysis (IGA). First, the topology optimization problem is formulated using the LSM based on the shape gradient. The shape gradient easily handles boundary propagation with topological changes. In the LSM, the topological gradient method as ...

متن کامل

The Geometry of Formal Varieties in Algebraic Topology I

Algebraic topology is full of computations with rings, and where we find rings we should seek geometry through methods of algebraic geometry. The geometry of formal varieties turn out to organize many interesting computations in topology, and certain formal varieties called commutative, one-dimensional formal groups give the best global picture of stable homotopy theory currently available. I w...

متن کامل

Computational Topology in Reconstruction, Mesh Generation, and Data Analysis

Many applications involving shapes and data not only require analyzing and processing their geometries, but also associated topologies. In the past two decades, computational topology, an area rekindled by computational geometry has emphasized processing and exploiting topological structures of shapes and data. The understanding of topological structures in the context of computations has resul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015